The inverse minisum circle location problem
نویسندگان
چکیده
Let n weighted points be given in the plane. The inverse version of minisum circle location problem deals with modifying weights minimum cost, such that sum distances from circumference a C radius r, to is minimized. classical model this contains infinite constraints. In paper, mathematical finite constraints presented. Then an efficient method developed for solving problem.
منابع مشابه
General minisum circle location
In our paper we approximate a set of given points by a general circle. More precisely, we consider the problem of locating and scaling the unit ball of some given norm k1 with respect to fixed points on the plane such that the sum of weighted distances between the circle and the fixed points is minimized, where the distance is measured by a norm k2. We present results for the general case. In t...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Inverse Problem for Circle Packing and Conformal Mapping
Figure 1.1 illustrates the fact that if a region is almost packed with circles of radius e in the hexagonal pattern and if the unit disk is packed in an isomorphic pattern with circles of varying radii then, after suitable normalization, the correspondence of circles converges to the Riemann mapping function as e —► 0 (see [15]). In the present paper an inverse of this result is obtained as ill...
متن کاملFeedback Algorithm for the Single-Facility Minisum Problem
A new accelerated algorithm to solve the single-facility minisum location problem is developed. The acceleration is achieved using a feedback factor. The proposed algorithm converges faster than the accelerating procedures available in the literature. Being nearly as simple as the classical Weiszfeld procedure, the new method can easily be implemented in real applications. Practical subroutines...
متن کاملThe inverse 1-center location problem on a tree
In an inverse network 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes a 1-center of the network. In this paper, we consider the inverse 1-center location problem on an unweighted tree network T with n + 1 vertices in which we are allowed to increase or reduce the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Yugoslav Journal of Operations Research
سال: 2022
ISSN: ['2334-6043', '0354-0243', '1820-743X']
DOI: https://doi.org/10.2298/yjor200715027g